/*
 * @Date: 2021-09-05 20:28:39
 * @Author: Acckno1
 * @LastEditTime: 2021-09-07 20:33:06
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e4 + 10;
int n, m;

bool is_prime(int n) {
    if (n == 2) return true;
    for (int i = 2; i < n; i ++ ) {
        if (n % i == 0) return false;
    }
    return true;
}

inline void solution() {
    cin >> n;
    unordered_map<int, int> hash;
    for (int i = 1; i <= n; i ++ ) {
        int idx;
        cin >> idx;
        hash[idx] = i;
    }

    cin >> m;
    unordered_set<int> st;
    while (m -- ) {
        int idx;
        cin >> idx;
        printf("%04d: ", idx);
        if (hash.find(idx) == hash.end()) 
            printf("Are you kidding?\n");
        else {
            int rank = hash[idx];
            if (st.count(idx)) {
                printf("Checked\n");
            } else {
                if (rank == 1) printf("Mystery Award\n");
                else if (is_prime(rank)) printf("Minion\n");
                else printf("Chocolate\n");
                st.insert(idx);
            }
        }
    }

}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}